Method for fast searching and analyzing inter-relations between patents from a patent database

ABSTRACT

This invention relates to a method for fast searching and analyzing inter-relations between patents associated with a target patent from a patent database having information on issued patents of United States and published European patents and creating a citation relation diagram. Especially, this invention is characterized by a method of creating a patent relation table through inter-relation between patents, classifying the data stored in the table into many independent folders by using a specific Hashing function and storing the classified data into the independent folders in the form of computer files.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] This invention relates to a method for fast searching and analyzing inter-relations between patents associated with a target patent from a patent database having information on issued patents of United States and published European patents and creating a citation relation diagram.

[0003] Especially, this invention is characterized by a method of creating a patent relation table through inter-relation between patents, classifying the data stored in the table into many independent folders by using a specific Hashing function and storing the classified data into independent folders in the form of computer files.

[0004] 2. Description of the Related Arts

[0005] So far, prior patent searching systems have used to create a patent relation table in order to find inter-relation between patents by searching inter-relations between patents from ‘Reference cited’ information stored in a prior art patent database and repeat the patent relation table many times. Therefore, it takes too much time to search and analysis the inter-relation between patents.

SUMMARY OF THE INVENTION

[0006] The present invention was devised to solve the above-noted problems.

[0007] And the object of the present invention is to provide a fast searching method capable of dramatically reducing searching time by adapting a method for creating a patent relation table through inter-relation between patents, classifying the data stored in the table into many independent folders by using a specific Hashing function and storing the classified data into independent folders in the form of computer files.

BRIEF DESCRIPTION OF THE DRAWINGS

[0008] The object, other features and advantages of the present invention will become more apparent by describing the preferable embodiment thereof with reference to the accompanying drawings, in which:

[0009]FIG. 1 illustrates a patent relation table as an embodiment of the present invention.

[0010]FIG. 2 is a form of a split file created by the present invention when the Hashing function is defined by the position of decimal points of an issued patent of the United States.

[0011]FIG. 3 is a form of a Backward file created by the present invention when the Hashing function is defined by the position of decimal points of an issued patent of the United States.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0012] This invention is a method for fast searching and analyzing inter-relations between patents associated with a patent (hereinafter, which is called to a ‘Target Patent’) from a patent database (hereinafter we call it ‘General Prior Patent Database’) having patent number information on citing patents (hereinafter we call it ‘Reference Cited’) at the time of application of the target patent and for creating diagrams indicating their patent relations (hereinafter, we call it ‘Relation Diagram’).

[0013] The method according to the present invention comprises the following steps.

[0014] That is, a step for inputting at least one patent number (hereinafter we call it ‘Patent Number’) of the Target Patent among of application number, published number (laid-opened number) and issued number,

[0015] a step for searching prior patents including the Target Patent as a prior patent (hereinafter we call it ‘Direct Related Patent’) in the Reference Cited field in the General Prior Patent Database and a step for searching repeatedly direct relating patents for each the searched Direct Related Patent (hereinafter we call it ‘Indirect Related Patent’ to the Target Patent) in order to analyze relations between the Target Patent and patents cited by the Target Patent at the time of application (hereinafter we call it ‘Backward Patent’),

[0016] a step for creating a citation relation table having two columns which comprise a regularly ordered patent number column (hereinafter we call it ‘the first column’) by using the searching result and a Backward patent number column for each patent number in the first column (hereinafter we call it ‘the second column’),

[0017] a step for creating independent folders in a directory by a Hashing function having patent numbers in the first column as parameters defined by user wherein each folder saves split files classified by the defined Hashing function within predetermined numbers,

[0018] a step for classifying each patent number in the first column into the independent file and then saving each split file to appropriate folder classified by the Hashing function wherein each split file saves all patent numbers in the second column having a same row to each patent number in the first column (that is, all patent numbers cited by any patent number at the time of application are saved in the split file),

[0019] a step for creating independent folders in another directory by a Hashing function having patent numbers in the first column as parameters defined by user wherein each folder saves the Backward files classified by the defined Hashing function within predetermined numbers,

[0020] a step for reading split files with ascending order from a split file having the oldest patent number and creating a Backward file data comprising pairs of patent number in the first column associated with its split file and patent number (Backward Patent) in the second column having same row to the associated patent number,

[0021] a step for determining whether any pair of Backward file data associated to the patent number of the Backward Patent among the Backward file data group is already created to other Backward file data,

[0022] if already created, a step for reading the created Backward file data in other Backward file and adding the read Backward file data into its own Backward file data,

[0023] a step for determining whether identical Backward file data are existed in a Backward file and stopping the adding step if existed or adding to the Backward file data if not existed,

[0024] a step for creating a Backward file after adding the created and added Backward file data and creating all Backward files by repeating the above steps, and

[0025] a step for sending the split files and Backward file to a graphic software and making Relation Diagrams.

[0026] On the other hand, a method for searching and analyzing prior patents citing an inputted Target Patent at the time of application according to the present invention comprises the following steps.

[0027] That is, a step for inputting at least one patent number (hereinafter, which is called to a ‘Patent Number’) of the Target Patent among of application number, published number (laid-opened number), and issued number,

[0028] a step for searching prior patents (hereinafter we call it ‘Direct Related Patent’) including the Target Patent in the Reference Cited field in the General Prior Patent Database and a step for searching repeatedly direct relating patents for each the searched Direct Related Patent (hereinafter we call it ‘Indirect Related Patent’ to the Target Patent) in order to analyze relations between the Target Patent and patents citing the Target Patent at the time of application (hereinafter we call it ‘Forward Patent’),

[0029] a step for creating a citation relation table having two columns which comprise a regularly ordered patent number column (hereinafter we call it ‘the first column’) by using the searching result and a Forward patent number column for each patent number in the first column (hereinafter we call it ‘the second column’),

[0030] a step for creating independent folders in a directors by a Hashing function having patent numbers in the first column as parameters defined by user wherein each folder saves split files classified by the defined Hashing function within predetermined numbers,

[0031] a step for classifying each patent number in the first column into the independent file and then saving each split file to appropriate folder classified by the Hashing function wherein each split file saves all patent numbers in the second column having a same row to each patent number in the second column (that is, all patent numbers citing its own patent number at the time of application are saved in the split file),

[0032] a step for creating independent folders in another directory by a Hashing function having patent numbers in tine first column as parameters defined by user wherein each folder saves the Forward files classified by the defined Hashing function within predetermined numbers,

[0033] a step for reading split files with descending order from a split file having the most recent patent number and creating a Backward file data comprising pairs of patent number in the first column associated with its split file and patent number (Forward Patent) in the second column having same row to the associated patent number,

[0034] a step for determining whether any pair of Forward file data associated to the patent number of the Forward Patent among the Forward file data group is already created to other Forward file data,

[0035] if already created, a step for reading the created Forward file data in other Forward file and adding the read Forward file data into its own Forward file data,

[0036] a step for determining whether identical Forward file data are existed in a Forward file and stopping the adding step if existed or adding to the Forward file data if not existed,

[0037] a step for creating a Forward file after adding the created and added Forward file data and creating all Forward files by repeating the above steps, and

[0038] a step for sending the split files and Forward file to a graphic software and making Relation Diagrams.

[0039] As an embodiment, if the Hashing function is defined by the position of decimal point of a patent number, it is preferable to create folders named of patent numbers which parts of it are deleted from the end and to save files in the created each folder having number of files within numbers of the deleted numbers.

[0040] And it is possible whether a Hashing function to classify split files and a Hashing function to classify Backward or Forward files are defined with same definition or not.

[0041] In the following, an embodiment is shown for more understanding with reference to drawings. In this embodiment, analyzing process for Backward patent is executed by through the U.S. Patent Database and the Hashing function is defined by the position of decimal points of a patent number and folder names are defined by patent numbers which parts of it are deleted from the end.

[0042]FIG. 1 illustrates a citation relation table including a column or regularly ordered patent numbers (the first column) and a column having Backward patent numbers for each patent number in the first column (the second column).

[0043] As shown in the citation relation table of the FIG. 1, the U.S. Pat. Nos. 6,300,001 and 6,300,002 respectively cited the U.S. Pat. Nos. 6,270,001 and 6,270,003 at the time of application, and the U.S. Pat. No. 6,300,003 cited the U.S. Pat. Nos. 6,300,001 and 6,300,002 at the time of application.

[0044]FIG. 2 illustrates a form of a creating split file in case of the Hashing function is defined by the position of decimal points of an issued patent of the United States. That is, firstly, creating independent folders under the C:\directory after deleting two digits of the patent numbers in the first column from the end (for example, the folder name is US63000 in case of U.S. Pat. No. 6,300,001) and secondly, making 100 split files in each folder (in this case, the names of split files are US6300000, . . . , US6300099) and finally, saving Backward patent numbers in each split file for appropriate patent numbers associated with appropriate split file.

[0045]FIG. 3 illustrates a form of a creating Backward file in case of the Hashing function is defined by the function of FIG. 2.

[0046] That is, firstly, creating independent folders under the D:\directory after deleting two digits of the patent numbers in the first column from the end (for example, the folder name is US63000 in case of U.S. Pat. No. 6,300,001) and secondly, making 100 Backward files in each folder (in this case, the names of Backward files are US6300000, . . . , US6300099).

[0047] And then, after reading split files with ascending order from a split file having the oldest patent number, creates a Backward file data comprising pairs of patent number in the first column associated with its split file and patent number (Backward Patent) in the second column having same row to the associated patent number.

[0048] At this time, after determining whether any pair of Backward file data associated to the patent number of the Backward Patent among the Backward file data group is already created to other Backward file data, reads the created Backward file data in other Backward file and adds the read Backward file data to its own Backward file data if already created.

[0049] Also, after determining whether identical Backward file data are existed in a Backward file, stops the adding step if existed or add to the Backward file data if not existed. In the same manner, creates a Backward file after adding the created and added Backward file data and creates all Backward files by repeating the above step.

[0050] The Backward file data for each Backward file according to this embodiment is as bellows.

[0051] That is, a Backward file data for US6300001 is (US6300001, US6270001) and a Backward file data for US6300003 is (US6300003, US6300001/US6300003, US6300002/US6300001, US6270001/US6300002, US6270003).

[0052] A Relation Diagrams is created by sending the split files and Backward file to a graphic software.

[0053] As the searching way for the Forward patent is similar to the Backward's except executing from the most recent patent number, the detail explanation for the Forward patent shall be omitted.

[0054] Due to this present invention, it is possible to dramatically reduce searching time by adapting a method for creating a patent relation table through inter-relation between patents, classifying the data stored in the table into many independent folders by using a specific Hashing function and storing the classified data into computer memory in the form of computer files. 

What is claimed is:
 1. A method for fast searching and analyzing inter-relations between patents associated with a patent (hereinafter we call it ‘Target Patent’) from a patent database (hereinafter we call it ‘General Prior Patent Database’) having patent number information on citing patents (hereinafter we call it ‘Reference Cited’) at the time of application of the target patent and for creating diagrams indicating their patent relations (hereinafter we call it ‘Relation Diagram’) said method comprising the steps of: a step for inputting at least one patent number (hereinafter we call it ‘Patent Number’) of the Target Patent among of application number, published number (laid-opened number) and issued number; and a step for starching prior patents including the Target Patent as a prior patent (hereinafter we call it ‘Direct Related Patent’) in the Reference Cited field in the General Prior Patent Database and a step for searching repeatedly direct relating patents for each the searched Direct Related Patent (hereinafter we call it ‘Indirect Related Patent’ to the Target Patent) in order to analyze relations between the Target Patent and patents cited by the Target Patent at the time of application (hereinafter we call it ‘Backward Patent’); a step for creating a citation relation table having two columns which comprise a regularly ordered patent number column (hereinafter we call it ‘the first column’) by using the searching result and a Backward patent number column for each patent number in the first column (hereinafter we call it ‘the second column’); a step for creating independent folders in a directory by a Hashing function having patent numbers in the first column as parameters defined by user wherein each folder saves split files classified by the defined Hashing function within predetermined numbers; a step for classifying each patent number in the first column into the independent file and then saving each split file to appropriate folder classified by the Hashing function wherein each split file saves all patent numbers in the second column having a same row to each patent number in the first column (that is, all patent numbers cited by any patent number at the time of application are saved in the split file); a step for creating independent folders in another directory by a Hashing function having patent numbers in the first column as parameters defined by user wherein each folder saves the Backward files classified by the defined Hashing function within predetermined numbers; a step for reading split files with ascending order from a split file having the oldest patent number and creating a Backward file data comprising pairs of patent number in the first column associated with its split file and patent number (Backward Patent) in the second column having same row to the associated patent number; a step for determining whether any pair of Backward file data associated to the patent number of the Backward Patent among the Backward file data group is already created to other Backward file data; if already created, a step for reading the created Backward file data in other Backward file and adding the read Backward file data into its own Backward file data; a step for determining whether identical Backward file data are existed in a Backward file and stopping the adding step if existed or adding to the Backward file data if not existed; a step for creating a Backward file after adding the created and added Backward file data and creating all Backward files by repeating the above steps; a step for sending the split files and Backward file to a graphic software and making Relation Diagrams.
 2. A method for fast searching and analyzing inter-relations between patents associated with a patent (hereinafter we call it ‘Target Patent’) from a patent database (hereinafter we call it ‘General Prior Patent Database’) having patent number information on citing patents (hereinafter we call it ‘Reference Cited’) at the time of application of the target patent and for creating diagrams indicating their patent relations (hereinafter we call it ‘Relation Diagram’) said method comprising the steps of: a step for inputting at least one patent number (hereinafter we call it ‘Patent Number’) of the Target Patent among of application number, published number (laid-opened number) and issued number; and a step for searching prior patents (hereinafter we call it ‘Direct Related Patent’) including the Target Patent in the Reference Cited field in the General Prior Patent Database and a step for searching repeatedly direct relating patents for each the searched Direct Related Patent (hereinafter we call it ‘Indirect Related Patent’ to he Target Patent) in order to analyze relations between the Target Patent and patents citing the Target Patent at the time of application (hereinafter we call it ‘Forward Patent’); a step for crating a citation relation table having two columns which comprise a regularly ordered patent number column (hereinafter we call it ‘the first column’) by using the searching result and a Forward patent number column for each patent number in the first column (hereinafter we call it ‘the second column’); a step for creating independent folders in a directory by a Hashing function having patent numbers in the first column as parameters defined by user wherein each folder saves split files classified by the defined Hashing function within predetermined numbers; a step for classifying each patent number in the first column into the independent file and then saving each split file to appropriate folder classified by the Hashing function wherein each split file saves all patent numbers in the second column having a same row to each patent number in the second column (that is, all patent numbers citing its own patent number at the time of application are saved in the split file); a step for creating independent folders in another directory by a Hashing function having patent numbers in the first column as parameters defined by user wherein each folder saves the Forward files classified by the defined Hashing function within predetermined numbers; a step for reading split files with descending order from a split file having the most recent patent number and creating a Backward file data comprising pairs of patent number in the first column associated with its split file and patent number (Forward Patent) in the second column having same row to the associated patent number; a step for determining whether any pair of Forward file data associated to the patent number of the Forward Patent among the Forward file data group is already created to other Forward file data; if already created, a step for reading the created Forward file data in other Forward file and adding the read Forward file data into its own Forward file data; a step for determining whether identical Forward file data are existed in a Forward file and stopping the adding step if existed or adding to the Forward file data if not existed; a step for creating a Forward file after adding the created and added Forward file data and creating all Forward files by repeating the above steps; a step for sending the split files and Forward file to a graphic software and making Relation Diagrams.
 3. The method as set forth in claim 1 or 2, wherein, if the Hashing function is defined by the position of decimal point of a patent number, said method is characterized by creating folders with names of patent number deleted part of patent numbers from the end and saving files in the created each folder having number of files within numbers of the deleted numbers.
 4. The method as set forth in claim 1 or 2, wherein the Hashing function to classify split files and the Hashing function to classify Backward or Forward files are defined with same definition.
 5. The method as set forth in claim 1 or 2, wherein the Hashing function to classify split files and the Hashing function to classify Backward or Forward files are not defined with same definition. 